A work-time optimal algorithm for computing all string covers
نویسندگان
چکیده
منابع مشابه
A Correction to "An Optimal Algorithm to Compute all the Covers of a String"
This note corrects an error in a paper recently published in this journal (An optimal algorithm to compute all the covers of a string, IPL 50-5 (1994) 239-246). The correction consists primarily of a new subalgorithm which is called by COMPUTE COVERS, the main algorithm presented in the paper referenced. It turns out that the new subalgorithm is itself suucient to solve the original problem | t...
متن کاملAn Optimal Algorithm to Compute all the Covers of a String
Let x denote a given nonempty string of length n jxj A string u is a cover of x if and only if every position of x lies within an occurrence of u within x Thus x is always a cover of itself In this paper we characterize all the covers of x in terms of an easily computed normal form for x The characterization theorem then gives rise to a simple recursive algorithm which computes all the covers o...
متن کاملComputing the k-covers of a string
Given a string x of length n and an integer constant k, the k-Cover Problem is defined to be the identification of all the sets of k substrings each of equal length that cover x. This problem can be solved by a general algorithm in OðnÞ time for constant alphabet size. We also generalize the k-Cover Problem, whereby a set of k substrings of different lengths are considered, which can be compute...
متن کاملAn Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String
An optimal O(loglogn) time concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that over general alphabets this is the fastest possible optimal algorithm. When p processors are available the bounds become 0(fnl;gnl +loglogrl+p/n12p).
متن کاملAn optimal algorithm for computing all subtree repeats in trees
Given a labelled tree T, our goal is to group repeating subtrees of T into equivalence classes with respect to their topologies and the node labels. We present an explicit, simple and time-optimal algorithm for solving this problem for unrooted unordered labelled trees and show that the running time of our method is linear with respect to the size of T. By unordered, we mean that the order of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00047-3